Hierarchical Ordering of Reticular Networks
نویسندگان
چکیده
منابع مشابه
Hierarchical Ordering of Reticular Networks
The structure of hierarchical networks in biological and physical systems has long been characterized using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of branching such that the order increases from distal parts of the network (e.g., mountain streams or capillaries) to the "root" of the network (e.g., the river outl...
متن کاملHierarchical Context-based Pixel Ordering
We present a context-based scanning algorithm which reorders the input image using a hierarchical representation of the image. Our algorithm optimally orders (permutes) the leaves corresponding to the pixels, by minimizing the sum of distances between neighboring pixels. The reordering results in an improved autocorrelation between nearby pixels which leads to a smoother image. This allows us, ...
متن کاملOrdering Networks
This extended abstract discusses the problem of defining quasi-orders that are suitable for use with network rewriting. The author’s primary interest is in using network rewriting as a tool for equational reasoning in algebraic theories with both operations and co-operations.
متن کاملFast optimal leaf ordering for hierarchical clustering
We present the first practical algorithm for the optimal linear leaf ordering of trees that are generated by hierarchical clustering. Hierarchical clustering has been extensively used to analyze gene expression data, and we show how optimal leaf ordering can reveal biological structure that is not observed with an existing heuristic ordering method. For a tree with n leaves, there are 2(n-1) li...
متن کاملHierarchical Ordering for Approximate Similarity Ranking
We propose a partial ordering that approximates a ranking of the items in a database according to their similarity to a query item. The partial ordering uses a single-link hierarchical clustering of the data items to rank them with respect to the query’s closest match. The technique avoids the O(kn) cost of calculating the similarity measure between the query and every item in the database. It ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2012
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0036715